Quantum hyperparallel algorithm for matrix multiplication
نویسندگان
چکیده
منابع مشابه
Quantum hyperparallel algorithm for matrix multiplication.
Hyperentangled states, entangled states with more than one degree of freedom, are considered as promising resource in quantum computation. Here we present a hyperparallel quantum algorithm for matrix multiplication with time complexity O(N(2)), which is better than the best known classical algorithm. In our scheme, an N dimensional vector is mapped to the state of a single source, which is sepa...
متن کاملQuantum Algorithms for Matrix Multiplication
This talk will describe recent progresses in the development of quantum algorithms for matrix multiplication. I will start with the case of Boolean matrices, and discuss the time complexity and query complexity of Boolean matrix multiplication in the quantum setting. I will then focus on other kinds of matrix products, in particular matrix products over algebraic structures known as semirings (...
متن کاملThe Mailman algorithm for matrix vector multiplication
Given an m×n matrix A we are interested in applying it to a real vector x ∈ R in less then the trivial O(mn) time. Since we are interested in a deterministic exact computation we must, at the very least, access all the entrees in A. This requires O(mn) operations and matches the running time of naively applying A to x. However, we claim that if the matrix contains only a constant number of dist...
متن کاملToward an Optimal Algorithm for Matrix Multiplication
Ever since the dawn of the computer age, researchers have been trying to find an optimal way of multiplying matrices, a fundamental operation that is a bottleneck for many important algorithms. Faster matrix multiplication would give more efficient algorithms for many standard linear algebra problems, such as inverting matrices, solving systems of linear equations, and finding determinants. Eve...
متن کاملA Practical Algorithm for Boolean Matrix Multiplication
Research on fast methods for multiplying two n x n Boolean matrices has followed two directions. On the one hand, there are the asymptotically fast methods derived from algorithms to multiply matrices with integer entries. On the other hand, it has been of interest to devise algorithms which, while inferior in the asymptotic sense, are simple enough to be advantageously implemented. This paper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2016
ISSN: 2045-2322
DOI: 10.1038/srep24910